Gorit Ms for €l Ypercu Yt Es

In this paper we present two new fault-tolerant routing algorithm for hypercubes. The first algorithm requires only local knowledge of the faulls whereas the s m n d algorithm requires global knowledge. Unlike previous fault-tolerant muting algorithms, our algorithms take into considemtion the dynamic conditions (link contention) of the network. We have shoum that checking for dynamic conditions in fault-tolerant algorithms U essential. Performance evaluation by extensive simulation of our algorithm3 and other fault-tolerant muting algorithms show that ours are better than previous algorithms by as much as 50% and 500% in time and space, respectively. We ala0 observed that global information about the location of faults does not give ILE additional benefit. This observation is true regardless of the considemtion of the dynamic conditions in the network.